Iterate-averaging sign algorithms for adaptive filtering with applications to blind multiuser detection

نویسندگان

  • Gang George Yin
  • Vikram Krishnamurthy
  • Cristina Ion
چکیده

Motivated by the recent developments on iterate averaging of recursive stochastic approximation algorithms and asymptotic analysis of sign-error algorithms for adaptive filtering, this work develops two-stage sign algorithms for adaptive filtering. The proposed algorithms are based on constructions of a sequence of estimates using large step sizes followed by iterate averaging. Our main effort is devoted to improving the performance of the algorithms by establishing asymptotic normality of a suitably scaled sequence of the estimation errors. The asymptotic covariance is calculated and shown to be the smallest possible. Hence, the asymptotic efficiency or asymptotic optimality is obtained. Then variants of the algorithm including sign-regressor procedures and constant-step algorithms are studied. The minimal window width of averaging is also dealt with. Finally, iterate-averaging algorithms for blind multiuser detection in direct sequence/code-division multiple-access (DS/CDMA) systems are proposed and developed, and numerical examples are examined.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Averaging blind sign algorithms for adaptive multiuser detection

This paper illustrates the use of “averaging” to improve the convergence rate of adaptive sign regressor and sign error multiuser detectors. The ingenious concept of averaging was invented by Polyak in 1990 – this paper analyses the performance of averaging in the sign error and sign regressor adaptive blind multiuser detection algorithms in DS/CDMA Systems.

متن کامل

Blind adaptive multiuser detection based on Kalman filtering

Although several Kalman filtering algorithms have been presented for adaptive multiuser detection, none is “blind” due to requiring training data sequences and/or more knowledge than the spreading waveform and delay of the desired user. This paper proposes a novel blind adaptive multiuser detector based on Kalman filtering and compares it with previously published LMS and RLS algorithms for bli...

متن کامل

Blind Adaptive Multiuser Detection with Averaging for Cellular Systems

In this paper, we consider blind adaptive multiuser detection in Correlated Waveform Multiple-Access (CWMA)based cellular radio networks. A common stochastic approximation (SA) based framework is proposed from which three blind adaptive algorithms for linear MMSE detection are obtained. Two of them coincide with previously proposed algorithms and the third is shown to be best suited for impleme...

متن کامل

Blind adaptive multiuser detection for cellular systems using stochastic approximation with averaging

In this paper, we consider blind adaptive multiuser detection in correlated waveform multiple-access-based cellular radio networks. A common stochastic approximation (SA)-based framework is proposed from which three blind adaptive algorithms for linear minimum mean squared error detection are obtained. Two of them coincide with previously proposed algorithms and the third is shown to be best su...

متن کامل

The Kalman Filtering Blind Adaptive Multi-user Detector Based on Tracking Algorithm of Signal Subspace

Multi-user detection is an effective method to reduce multiple access interference in code division multiple access (CDMA) systems. This paper discusses a signal subspace based blind adaptive multiuser detector and a Kalman filtering blind adaptive multiuser detector. Combining them together, a new Kalman filtering blind adaptive multiuser detector based on a tracking algorithm of the signal su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2003